Resolution of nonlinear interval problems using symbolic interval arithmetic
نویسندگان
چکیده
منابع مشابه
Resolution of nonlinear interval problems using symbolic interval arithmetic
An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] ⊂ [a, b]2". Interval problems often appear when we want to analyze the behavior of an interval solver. To solve interval problems, we propose to transform the constraints on intervals into constraints on their bounds. For instance...
متن کاملAuthor's personal copy Resolution of nonlinear interval problems using symbolic interval arithmetic
An interval problem is a problemwhere the unknown variables take interval values. Such a problem can be defined by interval constraints, such as ‘‘the interval 1⁄2a; b 1⁄2a; b ’’. Interval problems often appear when we want to analyze the behavior of an interval solver. To solve interval problems, we propose to transform the constraints on intervals into constraints on their bounds. For insta...
متن کاملSolving discrete minimax problems using interval arithmetic
We present an interval algorithm for solving discrete minimax problems where the constituent minimax functions are continuously differentiable functions of one real variable. Our approach is based on smoothing the max-type function by exploiting the Jaynes’s maximum entropy [Phys. Rev., 106:620–630, 1957]. The algorithm works within the branchand-bound framework and uses first order information...
متن کاملInterval Arithmetic Based Optimization in Nonlinear Regression
The optimization problems occurring in nonlinear regression normally cannot be proven unimodal. In the present paper applicability of global optimization algorithms to this problem is investigated with the focus on interval arithmetic based algorithms.
متن کاملSolving Decidability Problems with Interval Arithmetic
An affine iterated function system (IFS, [4]) over the reals is given by a set of contractive affine transformations on a complete metric space R for some positive natural number k. Thus an interesting problem is to decide, whether a given matrix M describes a contraction mapping, i.e. whether there exists some s < 1 such that |Mz| ≤ s|z| for each z ∈ R, where | · | denotes the Euclidean norm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2010
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2009.06.002